On the approximation of a polytope
نویسنده
چکیده
We show that the rate of convergence on the approximation of volumes of a convex symmetric polytope P ∈ R by its dual Lp-centroid bodies is independent of the geometry of P . In particular we show that if P has volume 1, lim p→∞ p log p „ |Z◦ p (P )| |P ◦| − 1 « = n. We provide an application to the approximation of polytopes by uniformly convex sets.
منابع مشابه
A remark on asymptotic enumeration of highest weights in tensor powers of a representation
We consider the semigroup $S$ of highest weights appearing in tensor powers $V^{otimes k}$ of a finite dimensional representation $V$ of a connected reductive group. We describe the cone generated by $S$ as the cone over the weight polytope of $V$ intersected with the positive Weyl chamber. From this we get a description for the asymptotic of the number of highest weights appearing in $V^{otime...
متن کاملEffect of IL-2 co-expressed or co-inoculated with immuno-dominant epitopes from VP1 protein of FMD virus on immune responses in BALB/c mice
Objective(s): The results of studies on vaccine development for foot-and-mouth disease (FMD) virus show that the use of inactivated vaccines for FMD virus is not completely effective. Novel vaccinations based on immuno-dominant epitopes have been shown to induce immune responses. Furthermore, for safety of immunization, access to efficient adjuvants against FMD virus seems to be critical.Materi...
متن کاملFeasible Region Approximation Using Convex Polytopes
A new technique for polytope approximation of the feasible region for a design is presented. This method is computationally less expensive than the simplicial approximation method [1]. Results on several circuits are presented, and it is shown that the quality of the polytope approximation is substantially better than an ellipsoidal approximation.
متن کاملNew analysis of the sphere covering problems and optimal polytope approximation of convex bodies
In this paper, we show that both sphere covering problems and optimal polytope approximation of convex bodies are related to optimal Delaunay triangulations, which are the triangulations minimizing the interpolation error between function ‖x‖2 and its linear interpolant based on the underline triangulations. We then develop a new analysis based on the estimate of the interpolation error to get ...
متن کاملSeed Polytopes for Incremental Approximation
Approximating a given three-dimensional object in order to simplify its handling is a classical topic in computational geometry and related fields. A typical approach is based on incremental approximation algorithms, which start with a small and topologically correct polytope representation (the seed polytope) of a given sample point cloud or input mesh. In addition, a correspondence between th...
متن کاملRandom Polytopes, Convex Bodies, and Approximation
Assume K ⊂ R is a convex body and Xn ⊂ K is a random sample of n uniform, independent points from K. The convex hull of Xn is a convex polytope Kn called random polytope inscribed in K. We are going to investigate various properties of this polytope: for instance how well it approximates K, or how many vertices and facets it has. It turns out that Kn is very close to the so called floating body...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011